Finite locally-quasiprimitive graphs

نویسندگان

  • Cai Heng Li
  • Cheryl E. Praeger
  • Akshay Venkatesh
  • Sanming Zhou
چکیده

A 1nite graph is said to be locally-quasiprimitive relative to a subgroup G of automorphisms if, for all vertices , the stabiliser in G of is quasiprimitive on the set of vertices adjacent to . (A permutation group is said to be quasiprimitive if all of its non-trivial normal subgroups are transitive.) The graph theoretic condition of local quasiprimitivity is strictly weaker than the conditions of local primitivity and 2-arc transitivity which have been studied previously. It is shown that the family of locally-quasiprimitive graphs is closed under the formation of a certain kind of quotient graph, called a normal quotient, induced by a normal subgroup. Moreover, a locally-quasiprimitive graph is proved to be a multicover of each of its normal quotients. Thus 1nite locally-quasiprimitive graphs which are minimal in the sense that they have no non-trivial proper normal quotients form an important sub-family, since each 1nite locally-quasiprimitive graph has at least one such graph as a normal quotient. These minimal graphs in the family are called “basic” locally-quasiprimitive graphs, and their structure is analysed. The process of constructing locally-quasiprimitive graphs with a given locally-quasiprimitive graph as a normal quotient is then considered. It turns out that this can be viewed as a problem of constructing covering graphs of certain multigraphs associated with . Further, it is shown that, under certain conditions, a locally-quasiprimitive graph can be reconstructed from knowledge of two of its normal quotients. Finally a series of open problems is presented. c © 2002 Elsevier Science B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Characterising finite locally s-arc transitive graphs with a star normal quotient∗

Let Γ be a finite locally (G, s)-arc transitive graph with s ≥ 2 such that G is intransitive on vertices. Then Γ is bipartite and the two parts of the bipartition are G-orbits. In previous work the authors showed that if G has a nontrivial normal subgroup intransitive on both of the vertex orbits of G, then Γ is a cover of a smaller locally s-arc transitive graph. Thus the “basic” graphs to stu...

متن کامل

An O'nan-scott Theorem for Finite Quasiprimitive Permutation Groups and an Application to 2-arc Transitive Graphs

A permutation group is said to be quasiprimitive if each of its nontrivial normal subgroups is transitive. A structure theorem for finite quasiprimitive permutation groups is proved, along the lines of the O'NanScott Theorem for finite primitive permutation groups. It is shown that every finite, non-bipartite, 2-arc transitive graph is a cover of a quasiprimitive 2-arc transitive graph. The str...

متن کامل

Locally s-distance transitive graphs

We give a unified approach to analysing, for each positive integer s, a class of finite connected graphs that contains all the distance transitive graphs as well as the locally s-arc transitive graphs of diameter at least s. A graph is in the class if it is connected and if, for each vertex v, the subgroup of automorphisms fixing v acts transitively on the set of vertices at distance i from v, ...

متن کامل

Bounding the size of a vertex-stabiliser in a finite vertex-transitive graph

In this paper we discuss a method for bounding the size of the stabiliser of a vertex in a G-vertex-transitive graph Γ. In the main result the group G is quasiprimitive or biquasiprimitive on the vertices of Γ, and we obtain a genuine reduction to the case where G is a nonabelian simple group. Using normal quotient techniques developed by the first author, the main theorem applies to general G-...

متن کامل

Se p 20 09 On finite edge - primitive and edge - quasiprimitive graphs ∗

Many famous graphs are edge-primitive, for example, the Heawood graph, the Tutte–Coxeter graph and the Higman–Sims graph. In this paper we systematically analyse edge-primitive and edge-quasiprimitive graphs via the O’Nan–Scott Theorem to determine the possible edge and vertex actions of such graphs. Many interesting examples are given and we also determine all G-edge-primitive graphs for G an ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 246  شماره 

صفحات  -

تاریخ انتشار 2002